From Nonstandard Analysis to Various Flavours of Computability Theory
نویسنده
چکیده
As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and higher-order computability theory, where the former (resp. the latter) sub-discipline deals with objects of type zero and one (resp. of all types). The aforementioned results regarding NSA deal exclusively with the higher-order case; we show in this paper that theorems of NSA also give rise to theorems in classical computability theory by considering so-called textbook proofs.
منابع مشابه
The Gandy-Hyland functional and a computational aspect of Nonstandard Analysis
In this paper, we highlight a new computational aspect of Nonstandard Analysis relating to higher-order computability theory. In particular, we prove that the Gandy-Hyland functional equals a primitive recursive functional involving nonstandard numbers inside Nelson’s internal set theory. From this classical and ineffective proof in Nonstandard Analysis, a term from Gödel’s system T can be extr...
متن کاملGrilliot's trick in Nonstandard Analysis
Recently, Dag Normann and the author have established a connection between higher-order computability theory and Nonstandard Analysis; new results in both fields are obtained by exploiting this connection ([28]). Now, on the side of computability theory, the technique known as Grilliot’s trick constitutes a template for explicitly defining the Turing jump functional (∃) in terms of a given effe...
متن کاملThe computational content of Nonstandard Analysis
Kohlenbach’s proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel’s pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded mid...
متن کاملNonstandard Models in Recursion Theory and Reverse Mathematics
We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.
متن کاملA New Approach to Nonstandard Analysis
In this paper, we propose a new approach to nonstandard analysis without using the ultrafilters. This method is very simple in practice. Moreover, we construct explicitly the total order relation in the new field of the infinitesimal numbers. To illustrate the importance of this work, we suggest comparing a few applications of this approach with the former methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017